Trust Aware Multi-Objective Metaheuristic Optimization Based Secure Route Planning Technique for Cluster Based IIoT Environment
نویسندگان
چکیده
Industrial Internet of Things (IIoT) finds use in several industrial applications like robots, medical devices, and software-defined manufacturing processes. Apart from the promising benefits IIoT networks, challenging issues need to be resolved, such as network connectivity, security, privacy, heterogeneity, scheduling, energy efficiency. Due large-scale deployment heterogeneity nodes some energy-limited have existed resulting reduced lifetime. At same time, security privacy are also considered major that exist design IIoT, which can addressed using secure routing techniques. In this view, study develops a trust-aware multiobjective metaheuristic optimization-based clustering with route planning (TAMOMO-SCRP) technique for cluster-based environment. The presented TAMOMO-SCRP mainly focuses on bald eagle search (BES) algorithm proposed model derives fitness function accomplishing maximum efficiency security. For an effective process, designs objective involving four parameters trust level (TL), communication cost (CC), residual (RE), node degree (ND). Besides, selection process is based two variables, namely, queue length link quality. assessing enhanced performance model, wide range experiments were carried out get outcomes life time(NLT) 39451,half die (HND) 25950 Stability period (SP) 8000 time calculated no. alive nodes. achieved make sure better against other recent approaches.
منابع مشابه
Logic-based Multi-Objective Optimization for Restoration Planning
After a disruption in an interconnected set of systems, it is necessary to restore service. This requires the determination of the tasks that need to be undertaken to restore service, and then scheduling those tasks using the available resources. This paper discusses combining mathematical programming and constraint programming into multiple objective restoration planning in order to schedule t...
متن کاملInterference-Aware and Cluster Based Multicast Routing in Multi-Radio Multi-Channel Wireless Mesh Networks
Multicast routing is one of the most important services in Multi Radio Multi Channel (MRMC) Wireless Mesh Networks (WMN). Multicast routing performance in WMNs could be improved by choosing the best routes and the routes that have minimum interference to reach multicast receivers. In this paper we want to address the multicast routing problem for a given channel assignment in WMNs. The channels...
متن کاملA confidence-aware interval-based trust model
It is a common and useful task in a web of trust to evaluate the trust value between two nodes using intermediate nodes. This technique is widely used when the source node has no experience of direct interaction with the target node, or the direct trust is not reliable enough by itself. If trust is used to support decision-making, it is important to have not only an accurate estimate of trust, ...
متن کاملPoint-Based Planning for Multi-Objective POMDPs
Many sequential decision-making problems require an agent to reason about both multiple objectives and uncertainty regarding the environment’s state. Such problems can be naturally modelled as multi-objective partially observable Markov decision processes (MOPOMDPs). We propose optimistic linear support with alpha reuse (OLSAR), which computes a bounded approximation of the optimal solution set...
متن کاملSMPSO: A New PSO Metaheuristic for Multi-objective Optimization
In this work we present a new multi-objective particle swarm optimization algorithm (PSO) characterized by the use of a strategy to limit the velocity of the particles. In this way, the Speed-constrained Multi-objective PSO (SMPSO) allows to produce new effective particle positions in those cases where the velocity becomes too high. Other features of SMPSO include the polynomial mutation as tur...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Access
سال: 2022
ISSN: ['2169-3536']
DOI: https://doi.org/10.1109/access.2022.3211971